Some colouring problems for Paley graphs
نویسندگان
چکیده
The Paley graph Pq, where q ≡ 1 (mod 4) is a prime power, is the graph with vertices the elements of the finite field Fq and an edge between x and y if and only if x − y is a non-zero square in Fq. This paper gives new results on some colouring problems for Paley graphs and related discussion.
منابع مشابه
Complexity of Generalized Colourings of Chordal Graphs
The generalized graph colouring problem (GCOL) for a fixed integer k, and fixed classes of graphs P1, . . . ,Pk (usually describing some common graph properties), is to decide, for a given graph G, whether the vertex set of G can be partitioned into sets V1, . . . , Vk such that, for each i, the induced subgraph of G on Vi belongs to Pi. It can be seen that GCOL generalizes many natural colouri...
متن کاملTopological Colouring Bounds and Graph Structure
Lovász invoked topological colouring bounds in proving Kneser’s Conjecture. Subsequently, numerous applications of topological techniques to graph colouring problems have arisen. However, even today, little is known about how to construct a graph with a particular topological colouring bound, or about the structure of such graphs. The aim of this thesis is to remedy this deficit. First, we will...
متن کاملComplexity of Generalised Colourings of Chordal Graphs
The graph colouring problem and its derivatives have been notoriously known for their inherent intractability. The difficulty seems to stem from the fact that we want a solution for any given graph, however complex it may be. One of the ways how to overcome this difficulty is to restrict possible inputs to the problem; that is, we ask for a solution only for graphs having some special structure...
متن کاملSampling in Paley-wiener Spaces on Combinatorial Graphs
A notion of Paley-Wiener spaces on combinatorial graphs is introduced. It is shown that functions from some of these spaces are uniquely determined by their values on some sets of vertices which are called the uniqueness sets. Such uniqueness sets are described in terms of Poincare-Wirtingertype inequalities. A reconstruction algorithm of Paley-Wiener functions from uniqueness sets which uses t...
متن کاملSome colouring problems for unit-quadrance graphs
The quadrance between two points A1 = (x1, y1) and A2 = (x2, y2) is the number Q(A1, A2) = (x1 − x2) + (y1 − y2). Let q be an odd prime power and Fq be the finite field with q elements. The unit-quadrance graph Dq has the vertex set F 2 q , and X,Y ∈ F 2 q are adjacent if and only if Q(A1, A2) = 1. In this paper, we study some colouring problems for the unit-quadrance graph Dq and discuss some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006